Meshless geometric subdivision

نویسندگان

Carsten Moenning

Facundo Mémoli

Guillermo Sapiro

Nira Dyn

Neil A. Dodgson

چکیده

Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with point cloud data directly, any processing is based on the given raw data and its underlying geometry rather than any arbitrary intermediate representations and generally artificial connectivity relations. In this paper, we introduce the notion of meshless, or point cloud, subdivision by extending concepts from recursive mesh subdivision to the point cloud case. We are primarily concerned with showing the conceptual viability of this idea and propose a first geometric meshless subdivision framework. By replacing the role of mesh connectivity by intrinsic point proximity information and devising a meshless geodesic subdivision operator, we avoid the costly surface reconstruction, simplification and potential remeshing preprocessing steps typically required for supporting mesh-based subdivision, steps which are in general not directly related to the underlying object geometry. Furthermore, the maintenance of any global combinatorial data structure such as a mesh connectivity graph is not required. This property also makes our approach relatively easily extensible to the processing of point-based representations of higher-dimensional sur∗The author performed this work whilst visiting the University of Minnesota. faces. Apart from introducing the idea of meshless subdivision, our main contributions are, firstly, a first meshless geodesic subdivision operator. Secondly, we present a new method for the computation of geodesic weighted averages on manifold surfaces, which are at the heart of our point cloud subdivision framework.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intrinsic point-based surface processing

The need for the processing of surface geometry represents an ubiquitous problem in computer graphics and related disciplines. It arises in numerous important applications such as computer-aided design, reverse engineering, rapid prototyping, medical imaging , cultural heritage acquisition and preservation, video gaming and the movie industry. Existing surface processing techniques predominantl...

متن کامل

Analysis of Thin Plates by the Element-Free Galerkin Method

A meshless approach to the analysis of arbitrary Kirchhoff plates by the Element-Free Galerkin (EFG) method is presented. The method is based on moving least squares approximant. The method is meshless, which means that the discretization is independent of the geometric subdivision into “finite elements”. The satisfaction of the C1 continuity requirements are easily met by EFG since it requires...

متن کامل

Analysis of Thin Shells by the Element-Free Galerkin Method

A meshless approach to the analysis of arbitrary Kirchhoff shells by the Element-Free Galerkin (EFG) method is presented. The shell theory used is geometrically exact and can be applied to deep shells. The method is based on moving least squares approximant. The method is meshless, which means that the discretization is independent of the geometric subdivision into “finite elements”. The satisf...

متن کامل

Meshless parameterization and surface reconstruction

This paper proposes a method called meshless parameterization for param eterizing and triangulating single patch unorganized point sets The points are mapped into a planar parameter domain by solving a sparse linear system By making a stan dard triangulation of the parameter points we obtain a corresponding triangulation of the original data set

متن کامل